A Proof of Correctness for Rococo
نویسندگان
چکیده
This paper presents a proof of correctness for Rococo, a new concurrency control protocol for distributed transactions. Rococo can achieve strict serializability without the cost of blocking or aborting. It executes a transaction as a collection of atomic pieces, each of which commonly involves only a single server. Servers first track dependencies between concurrent transactions without actually executing them. At commit time, a transaction’s dependency information is sent to all servers so they can re-order conflicting pieces and execute them in a serializable order.
منابع مشابه
Extracting More Concurrency from Distributed Transactions
Distributed storage systems run transactions across machines to ensure serializability. Traditional protocols for distributed transactions are based on two-phase locking (2PL) or optimistic concurrency control (OCC). 2PL serializes transactions as soon as they conflict and OCC resorts to aborts, leaving many opportunities for concurrency on the table. This paper presents ROCOCO, a novel concurr...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملRoCoCo: Receiver-Initiated Opportunistic Data Collection and Command Multicasting for WSNs
Many data collection protocols have been proposed to cater for the energy-efficient flow of sensor data from distributed sources to a sink node. However, the transmission of control commands from the sink to one or only a small set of nodes in the network is generally unsupported by these protocols. Supplementary protocols for packet routing and data dissemination have been developed to this en...
متن کاملComparative Analysis of Baroque and Rococo in Interior Decoration of the Masudieh Complex & Qavam Al-Saltaneh Building
متن کامل
On the design and security of a lattice-based threshold secret sharing scheme
In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...
متن کامل